COMPARISON OF THE MINIMAX AND PRODUcT BACK-UP RULES IN A VARIETY OF GAMES!
نویسنده
چکیده
This paper describes comparisons of the minimax back-up rule and the product back-up rule on a wide variety of games, including Pgames, G-games, three-hole kalah, othello, and Ballard's incremental game. In three-hole kalah, the product rule plays better than a minimax search to the same depth. This is a remarkable result, since it is the first widely known game in which product has been found to yield better play than minimax. Furthermore, the relative performance of minimax and product is related to a parameter called the rate of heuristic fiaw (rhf). Thus, rhf has potential use in predicting when to use a back-up rule other than minimax. 1 A condensed version of this paper, entitled "Comparing Minimax and Product in a Variety of Games", appears in Proc. AAAI-87. 2 This work has been supported in part by a Systems Research Center fellowship. S This work has been supported in part by the following sources: an NSF Presidential Young Investigator Award to Dana Nau, NSF NSFD CDR-85-o0108 to the University of Maryland Systems Research Center, IBM Research, and General Motors Research Laboratories.
منابع مشابه
Comparing Minimax and Product in a Variety
This paper describes comparisons of the minimax backup rule and the product back-up rule on a wide variety of games, including P-games, G-games, three-hole kalah, Othello, and Ballard’s incremental game. In three-hole kalah, the product rule plays better than a minimax search to the same depth. This is a remarkable result, since it is the first widely known game in which product has been found ...
متن کاملPredicting the Performance of Minimax and Product in Game-Tree Searching'
The discovery t ha t the minimax decision rule performs poorly in some games has sparked interest in possible al ternatives to minimax. Until recently, the only games in which minimax was known to perform poorly were games which were mainly of theoretical interest. However, this paper reports results showing poor performance of minimax in a more common game called kalah. For the kalah games tes...
متن کاملPredicting The Performance of Minimax and Product in Game-Tree
The discovery that the minimax decision rule performs poorly in some games has sparked interest in possible alternatives to minimax. Until recently, the only games in which minimax was known to perform poorly were games which were mainly of theoretical interest. However, this paper reports results showing poor performance of minimax in a more common game called kalah. For the kalah games tested...
متن کاملA Theory of Game Tree$
A theory of heuristic game tree search and evaluation functions for estimating minimax values is developed. The result is quite different from the traditional minimsx approach to game playing, and it leads to product-propagation rules for backing up values when subpositions in the game are independent. In this theory Nau’s paradox is avoided and deeper searching leads to better moves if one has...
متن کاملMastering multi-player games
We consider multi-player games, and the guarantees that a master player that plays on behalf of a set of players can offer them, without making any assumptions on the rationality of the other players. Our model consists of an (n + 1)-player game, with m strategies per player, in which a master player M forms a coalition with nontransferable utilities among n players, and the remaining player is...
متن کامل